package JD;

import common.Node;

import java.util.Queue;
import java.util.Scanner;

/**
 * @author zhangmin
 * @create 2022-03-19 19:44
 */
public class jd0319 {
/*    public static void main(String[] args) {
        Scanner cin=new Scanner(System.in);
        int n=cin.nextInt();
        for (int i = 0; i < n; i++) {
            int x=cin.nextInt();
            int y=cin.nextInt();
            //直接模拟
            int res=0;
            while (x!=y){
                if(x%3==0){
                    x=x/3;
                }else {
                    x+=1;
                }
                res++;
            }
            System.out.println(res);
        }
    }*/
/*    public void BFS(int n,int[][] edges,int[][] path){
        Queue<Node>
    }*/
    public static void main(String[] args) {
        Scanner cin=new Scanner(System.in);
        int n=cin.nextInt(),m=cin.nextInt();
        int[] dingdian=new int[n];
        for (int i = 0; i < n; i++) {
            dingdian[i]=i;
        }
        int[][] edges=new int[n][n];
        for (int i = 0; i < m; i++) {
            int u=cin.nextInt(),v=cin.nextInt(),p=cin.nextInt();
            edges[u][v]=edges[v][u]=p;
        }

    }
}
